Oriented Equational Logic Programming is Complete
نویسنده
چکیده
We show the completeness of an extension of SLDDresolution to the equational setting. This proves a conjecture of Laurent Fribourg and shows the completeness of an implementation of his. It is the rst completeness result for superposition of equational Horn clauses which reduces to SLD resolution in the nonnequational case. The inference system proved complete is actually more general than the one of Fribourg, because it allows for a selection rule on program clauses. Our completeness result also has implications for Conditional Narrowing and Basic Conditional Narrowing.
منابع مشابه
Representing Actions in Equational Logic Programming
A sound and complete approach for encoding the action description language A developed by M. Gelfond and V. Lifschitz in an equational logic program is given. Our results allow the comparison of the resource-oriented equational logic based approach and various other methods designed for reasoning about actions, most of them based on variants of the situation calculus, which were also related to...
متن کاملModelling theories of actions by Equational Logic Programs
A sound and complete approach for encoding the action description language A developed by M. Gelfond and V. Lifschitz in an equational logic program is given. Our results allow the comparison of the resource-oriented equational logic based approach and various other methods designed for reasoning about actions, most of them based on variants of the situation calculus, which were also related to...
متن کاملMulti-paradigm Logic Programming Combining Rewrite Tools for Equational Logic Programming
Introducing equality into standard Horn clauses leads to a programming paradigm known as Equational Logic Programming. We propose here a scheme for the evaluation of such equational logic programs combining two powerful operational techniques : directed narrowing for the equational part and linear completion for the logical part. Thus we provide a goal-oriented solving procedure, keeping the we...
متن کاملA Formalization of Objects Using Equational Dynamic Logic
Order-sorted equational logic is extended with dynamic logic to a specification language for dynamic objects. Special attention is paid to different concepts of encapsulation that play a role in object-orientation. It is argued that the resulting language, CMSL, meets those requirements of the object-oriented database system manifesto [6] that are applicable to object-oriented conceptual models...
متن کاملCompleteness of Category-Based Equational Deduction
Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 1997